Eecient Buuering for Concurrent Disk and Tape I/o

نویسنده

  • Jussi Myllymaki
چکیده

Tertiary storage is becoming increasingly important for many organizations involved in large-scale data analysis and data mining activities. Yet database management systems (DBMS) and other data-intensive systems do not incorporate tertiary storage as a rst-class citizen in the storage hierarchy. For instance, the typical solution for bringing tertiary-resident data under the control of a DBMS is to use operating system facilities to copy the data to secondary storage, and then to perform query optimization and execution as if the data had been in secondary storage all along. This approach fails to recognize the opportunities for saving execution time and storage space if the data were accessed on tertiary devices directly and in parallel with other I/Os. In this paper we examine issues in accessing secondary and tertiary storage in parallel and suggest buuering mechanisms for increasing the through-put of applications with concurrent, intensive I/O requirements. We rst identify several factors that determine the parallel I/O performance of secondary and tertiary storage devices. We discuss the performance characteristics of magnetic disks and magnetic tapes when used alone and when used concurrently, sharing the same I/O bus. We then describe alternative buuering schemes for parallel I/O and analyze their eeciency via an experimental implementation.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Buuering of Index Structures

Buuering of index structures is an important problem, because disk I/O dominates the cost of queries. In this paper, we compare existing algorithms for uniform, nonuniform static and nonuniform dynamic access patterns. We experimentally show that the LRU-2 method is better than the other methods. We also propose an eecient implementation of the LRU-2 algorithm. In the second part of the paper, ...

متن کامل

Pipelined Disk Arrays for Digital Movie Retrieval

We develop a reliable disk array based storage architecture for digital video retrieval. Our goals are twofold: maximizing the number of concurrent real-time sessions while minimizing the buuering requirements , and ensuring a high degree of reliability. The rst goal is achieved by adopting a pipelined approach and by reducing latencies through specialized disk caching and constrained data plac...

متن کامل

Pipelined Disk Arrays for Digital Movie Retrieval 1

We develop a reliable disk array based storage architecture for digital video retrieval. Our goals are twofold: maximizing the number of concurrent real-time sessions while minimizing the buuering requirements, and ensuring a high degree of reliability. The rst goal is achieved by adopting a pipelined approach and by reducing latencies through specialized caching and constrained data placement ...

متن کامل

Tape-Disk Join Strategies under Disk Contention

Large-scale data warehousing, data mining, and scientific applications require the analysis of terabytes of facts data accumulated over long periods of time. Tape libraries are suitable devices for storing such mass data. The online analytical processing (OLAP) of this data typically leads to long-running aggregation queries joining the tape-resident facts relation with disk-resident dimension ...

متن کامل

An Analytical Study of Object Identiier Indexing

To avoid OID index retrieval becoming a bottleneck, eecient buuering strategies are needed to minimize the number of disk accesses. In this paper, we develop analytical cost models which we use to nd optimal sizes of the index page buuer and the index entry cache, for diierent memory sizes, index sizes, and access patterns. Because existing buuer hit estimation models are not applicable for ind...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996